Maximum-width empty square and rectangular annulus
نویسندگان
چکیده
An annulus is, informally, a ring-shaped region, often described by two concentric circles. The maximum-width empty problem asks to find an of certain shape with the maximum possible width that avoids given set n points in plane. This can also be interpreted as finding optimal location obnoxious facility among input points. In this paper, we study square and rectangular variants problem, present first nontrivial algorithms. Specifically, our algorithms run O(n3) O(n2logn) time for computing axis-parallel annulus, respectively. Both use only O(n) space.
منابع مشابه
Maximum-width Axis-Parallel Empty Rectangular Annulus
Given a set P of n points on R, we address the problem of computing an axis-parallel empty rectangular annulus A of maximumwidth such that no point of P lies inside A but all points of P must lie inside, outside and on the boundaries of two parallel rectangles forming the annulus A. We propose an O(n) time and O(n) space algorithm to solve the problem. In a particular case when the inner rectan...
متن کاملLargest Empty Axis-Parallel Rectangular Annulus
In Euclidean plane, a rectangular annulus is the region between parallel rectangles such that the smaller rectangle lies wholly inside the outer rectangle. Given a set P of n points in the two dimensional plane, we propose O(n) time and O(n) space algorithm to identify an axis-parallel largest empty annulus amidst the points of P . We are not aware of any published work on this problem. To the ...
متن کاملThe Largest Empty Annulus Problem
Given a set of n points S in the Euclidean plane, we address the problem of computing an annulus A, (open region between two concentric circles) of largest width, that partitions S into a subset of points inside and a subset of points outside the circles, such that no point p ∈ S lies in the interior of A. This problem can be considered as a maximin facility location problem for n points such t...
متن کاملMinimum Convex Partitions and Maximum Empty Polytopes
Let S be a set of n points in Rd. A Steiner convex partition is a tiling of conv(S) with empty convex bodies. For every integer d, we show that S admits a Steiner convex partition with at most ⌈(n − 1)/d⌉ tiles. This bound is the best possible for points in general position in the plane, and it is best possible apart from constant factors in every fixed dimension d ≥ 3. We also give the first c...
متن کاملSquare integer Heffter arrays with empty cells
A Heffter array H(m,n; s, t) is an m× n matrix with nonzero entries from Z2ms+1 such that i) each row contains s filled cells and each column contains t filled cells, ii) every row and column sum to 0, and iii) no element from {x,−x} appears twice. Heffter arrays are useful in embedding the complete graph K2nm+1 on an orientable surface where the embedding has the property that each edge border...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry: Theory and Applications
سال: 2021
ISSN: ['0925-7721', '1879-081X']
DOI: https://doi.org/10.1016/j.comgeo.2021.101747